Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control

نویسنده

  • Peter R. Wolenski
چکیده

This paper describes some recent results in HamiltonJacobi theory that hold under strong convexity assumptions on the data. Generalizations of linearquadratic control models satisfy such assumptions, for example. The results include a global method of characteristics and a strong duality theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization Techniques for State-Constrained Control and Obstacle Problems1,2,3

The design of control laws for systems subject to complex state constraints still presents a significant challenge. This paper explores a dynamic programming approach to a specific class of such problems, that of reachability under state constraints. The problems are formulated in terms of nonstandard minmax and maxmin cost functionals, and the corresponding value functions are given in terms o...

متن کامل

Hamilton-Jacobi Theory and Parametric Analysis in Fully Convex Problems of Optimal Control

For optimal control problems satisfying convexity conditions in the state as well as the velocity, the optimal value is studied as a function of the time horizon and other parameters. Conditions are identified in which this optimal value function is locally Lipschitz continuous and semidifferentiable, or even differentiable. The Hamilton-Jacobi theory for such control problems provides the fram...

متن کامل

Convexity in Hamilton-Jacobi Theory II: Envelope Representations

Upper and lower envelope representations are developed for value functions associated with problems of optimal control and the calculus of variations that are fully convex, in the sense of exhibiting convexity in both the state and the velocity. Such convexity is used in dualizing the upper envelope representations to get the lower ones, which have advantages not previously perceived in such ge...

متن کامل

Envelope representations in Hamilton-Jacobi theory for fully convex problems of control

This paper is a sequel to the one in this same session which surveys recent results on the role of convexity in Hamilton-Jacobi theory. We describe here how value functions in optimal control can be represented as upper and lower envelopes involving so-called kernel functions. Particularly noteworthy is a lower envelope formula given in terms of the dualizing kernel, which is a value function i...

متن کامل

Motion Planning for Multiple Systems under Coordinated Constraints

Two problems of motion planning for controlled systems which are required to attain a given target set under coordinated constraints are formulated and solved using dynamic optimization techniques. Constraint coordination arises when the state of each system is mapped onto state constraints for other systems. These problems are formulated in terms of backward reach sets which are the sub-zero l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001